Normality: A Consistency Condition for Concurrent Objects
نویسندگان
چکیده
Linearizability is a consistency condition for concurrent objects (objects shared by concurrent processes) that exploits the semantics of abstract data types. It provides the illusion that each operation applied by concurrent processes takes eeect instantaneously at some point between the beginning and the end of its execution. When compared with other consistency conditions (such as sequential consistency) Linearizability satisses the Locality property (i.e, a system is linearizable if each object taken individually is linearizable) and the Non-Blocking property (i.e., termination of an invoked operation does not depend on other pending invocations). Those are noteworthy properties as they allow concurrent systems to be designed and constructed in a modular fashion. This paper introduces a consistency condition called Normality that is less constraining than Linearizability (in the sense it does not refer to a global real-time order) and still satisses Locality and Non-Blocking. As it does not refer to a global real-time, Normality is well-suited to objects supported by asynchronous distributed systems and can consequently be seen as an adaptation of Linearizability for these systems.
منابع مشابه
Quiescent Consistency: Defining and Verifying Relaxed Linearizability
Concurrent data structures like stacks, sets or queues need to be highly optimized to provide large degrees of parallelism with reduced contention. Linearizability, a key consistency condition for concurrent objects, sometimes limits the potential for optimization. Hence algorithm designers have started to build concurrent data structures that are not linearizable but only satisfy relaxed consi...
متن کاملQuasi-maximum likelihood estimation of periodic GARCH processes
This paper establishes the strong consistency and asymptotic normality of the quasi-maximum likelihood estimator (QMLE) for a GARCH process with periodically time-varying parameters. We first give a necessary and sufficient condition for the existence of a strictly periodically stationary solution for the periodic GARCH (P -GARCH) equation. As a result, it is shown that the moment of some posit...
متن کاملA Versatile STM Protocol with Invisible Read Operations That Satisfies the Virtual World Consistency Condition
The aim of a Software Transactional Memory (STM) is to discharge the programmers from the management of synchronization in multiprocess programs that access concurrent objects. To that end, a STM system provides the programmer with the concept of a transaction. The job of the programmer is to decompose each sequential process the application is made up of into transactions. A transaction is a p...
متن کاملContextual Trace Refinement for Concurrent Objects: Safety and Progress
Correctness of concurrent objects is defined in terms of safety properties such as linearizability, sequential consistency, and quiescent consistency, and progress properties such as wait-, lock-, and obstruction-freedom. These properties, however, only refer to the behaviours of the object in isolation, which does not tell us what guarantees these correctness conditions on concurrent objects p...
متن کاملFrom Causal Consistency to Sequential Consistency in Shared Memory Systems
Sequential consistency and causal consistency constitute two of the main consistency criteria used to deene the semantics of accesses in the shared memory model. An execution is sequentially consistent if all processes can agree on a same legal sequential history of all the accesses; if processes perceive distinct legal sequential histories of all the accesses, the execution is only causally co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Parallel Processing Letters
دوره 9 شماره
صفحات -
تاریخ انتشار 1999